Full Bandwidth Broadcast, Reduction and Scan with Only Two Trees

نویسندگان

  • Peter Sanders
  • Jochen Speck
  • Jesper Larsson Träff
چکیده

We present a new, simple algorithmic idea for exploiting the potential for bidirectional communication present in many modern interconnects for the collective MPI operations broadcast, reduction and scan. Our algorithms achieve up to twice the bandwidth of most previous and commonly used algorithms. In particular, our algorithms for reduction and scan are the currently best known. Experiments on clusters with Myrinet and InfiniBand interconnects show significant reductions in running time for broadcast and reduction, for reduction even close to the best possible factor of two.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-tree algorithms for full bandwidth broadcast, reduction and scan

We present a new, simple algorithmic idea for the collective communication operations broadcast, reduction, and scan (prefix sums). The algorithms concurrently communicate over two binary trees which both span the entire network. By careful layout and communication scheduling, each tree communicates as efficiently as a single tree with exclusive use of the network. Our algorithms thus achieve u...

متن کامل

Effects of Deficit and Cutoff Irrigation During Different Phenological Stages of Fruit Growth on Production in Mature Almond Trees cv. ‘Mamaei’

Regulated deficit irrigation (RDI) is commonly used during different phenological stages of fruit growth and development in almond trees to reduce the amount of irrigation water applied without or with only very small reductions in yield. Therefore, to study the effects of deficit and cutoff irrigation during different phenological stages of fruit growth and development in almond cv. “Mamaei” p...

متن کامل

Collective operations for wide-area message passing systems using adaptive spanning trees

We propose a method for wide-area message-passing systems to perform broadcasts and reductions efficiently using latency and bandwidth-aware spanning trees constructed at run-time. These trees are updated when processes join or leave a computation, allowing effective execution to continue. We have implemented our proposal on the Phoenix Message-Passing Library and performed experiments using 16...

متن کامل

Efficient broadcast encryption with user profiles

Broadcast encryption (BE) deals with secure transmission of a message to a group of users such that only an authorized subset of users can decrypt the message. Some of the most effective BE schemes in the literature are the tree-based schemes of complete subtree (CS) and subset difference (SD). The key distribution trees in these schemes are traditionally constructed without considering user pr...

متن کامل

Parallel Implementations of Combinations of Broadcast, Reduction and Scan

Broadcast, Reduction and Scan are popular functional skeletons which are used in distributed algorithms to distribute and gather data. We derive new parallel implementations of combinations of Broadcast, Reduction and Scan via a tabular classification of linearly recursive functions. The trick in the derivation is to not simply combine the individual parallel implementations of Broadcast, Reduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007